Determinant versus Permanent: salvation via generalization? The algebraic complexity of the Fermionant and the Immanant

نویسنده

  • Nicolas de Rugy-Altherre
چکیده

The fermionant Fermn(x̄) = ∑ σ∈Sn (−k)c(π) ∏n i=1 xi,j can be seen as a generalization of both the permanent (for k = −1) and the determinant (for k = 1). We demonstrate that it is VNP-complete for any rational k , 1. Furthermore it is #P -complete for the same values of k. The immanant is also a generalization of the permanent (for a Young diagram with a single line) and of the determinant (when the Young diagram is a column). We demonstrate that the immanant of any family of Young diagrams with bounded width and at least n boxes at the right of the first column is VNP-complete.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The complexity of the fermionant, and immanants of constant width

In the context of statistical physics, Chandrasekharan and Wiese recently introduced the fermionant Fermk, a determinant-like function of a matrix where each permutation π is weighted by −k raised to the number of cycles in π . We show that computing Fermk is #P-hard under polynomial-time Turing reductions for any constant k > 2, and is ⊕P-hard for k = 2, where both results hold even for the ad...

متن کامل

Geometric complexity theory and matrix powering

Valiant’s famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related problems via algebraic geometry and representation theory. Their approach works by multiplying the permanent polynomial with a high power of a linear form (a proc...

متن کامل

An introduction to geometric complexity theory

I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.

متن کامل

Generalized matrix functions, determinant and permanent

In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...

متن کامل

A Strong Regular Relation on ?-Semihyperrings

The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper‌rings and a generalizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1309.2156  شماره 

صفحات  -

تاریخ انتشار 2013